An Example of Cloning Graph Transformation Rules for Programming

نویسندگان

  • Mark Minas
  • Berthold Hoffmann
چکیده

Abstract Graphical notations are already popular for the design of software, as witnessed by the success of the Uniform Modeling Languages (UML). In this paper, we advocate the use of graphs and graph transformation for programming graph-based systems. Our case study, the flattening of hierarchical statecharts, reveals that cloning, a recently proposed transformation concept, makes graph transformation rules (in the double-pushout approach) more expressive. Thus programming becomes easier, and gets along with simpler control conditions in particular.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Linear plus fractional multiobjective programming problem with homogeneous constraints using fuzzy approach

  We develop an algorithm for the solution of multiobjective linear plus fractional programming problem (MOL+FPP) when some of the constraints are homogeneous in nature. Using homogeneous constraints, first we construct a transformation matrix T which transforms the given problem into another MOL+FPP with fewer constraints. Then, a relationship between these two problems, ensuring that the solu...

متن کامل

Rooted Graph Programs

We present an approach for programming with graph transformation rules in which programs can be as efficient as programs in imperative languages. The basic idea is to equip rules and host graphs with distinguished nodes, so-called roots, and to match roots in rules with roots in host graphs. This enables graph transformation rules to be matched in constant time, provided that host graphs have a...

متن کامل

Graph Transformation Unitsand Modules

The aim of this chapter is to introduce the notions of transformation units and transformation modules as means of constructing large graph transformation systems from small ones in a structured and systematic way. A transformation unit comprises a set of rules, descriptions of initial and terminal graphs, and a control condition. Moreover, it may use other transformation units for structuring ...

متن کامل

Staged Translation of Graph Transformation Rules

Graph transformation rules provide an opportunity to specify model transformations in a declarative way at a high level of abstraction. So far, compilers have translated graph transformation rules into conventional programming languages such as Java, C, or C#. In contrast, we follow a staged translation approach: We developed a compiler which translates graph transformation rules into a procedu...

متن کامل

Close interval approximation of piecewise quadratic fuzzy numbers for fuzzy fractional program

  The fuzzy approach has undergone a profound structural transformation in the past few decades. Numerous studies have been undertaken to explain fuzzy approach for linear and nonlinear programs. While, the findings in earlier studies have been conflicting, recent studies of competitive situations indicate that fractional programming problem has a positive impact on comparative scenario. We pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electr. Notes Theor. Comput. Sci.

دوره 211  شماره 

صفحات  -

تاریخ انتشار 2008